Transition to Independence
نویسندگان
چکیده
منابع مشابه
Comparing Transition Systems with Independence and Asynchronous Transition Systems
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the choice of a derived versus a primitive notion of event which induces considerable differences and makes the two models suitable for different purposes. This opens the problem of investigat...
متن کاملTransition systems with independence and multi-arcs
We extend the model of transition systems with independence in order to provide it with a feature relevant in the noninterleaving analysis of concurrent systems, namely multi-arcs. Moreover, we study the relationships between the category of transition systems with independence and multi-arcs and the category of labeled asynchronous transition systems, extending the results recently obtained by...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملPhase transition in kinetic exchange opinion models with independence
In this work we study the critical behavior of a three-state (+1, −1, 0) opinion model with independence. Each agent has a probability q to act as independent, i.e., he/she can choose his/her opinion independently of the opinions of the other agents. On the other hand, with the complementary probability 1 − q the agent interacts with a randomly chosen individual through a kinetic exchange. Our ...
متن کاملExact Transition Probabilities for the Independence Metropolis Sampler
A recent result of Jun Liu's has shown how to compute explicitly the eigen-values and eigenvectors for the Markov chain derived from a special case of the Hastings sampling algorithm, known as the indepdendence Metropolis sampler. In this note, we show how to extend the result to obtain exact n-step transition probabilities for any n. This is done rst for a chain on a nite state space, and then...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Academic Medicine
سال: 2017
ISSN: 1040-2446
DOI: 10.1097/acm.0000000000001473